Complete Sets of Orthogonal Self-Orthogonal Latin Squares

نویسندگان

  • George Graham
  • Charles E. Roberts
چکیده

We show how to produce algebraically a complete orthogonal set of Latin squares from a left quasifield and how to generate algebraically a maximal set of self-orthogonal Latin squares from a left nearfield. For a left Veblen-Wedderburn system, we establish the algebraic relationships between the standard projective plane construction of a complete set of Latin squares, our projective plane construction, and our algebraic nearfield generation. Via a projective plane construction, we establish the equivalence of a complete set of self-orthogonal Latin squares and a restricted ((0), ∞)-Desarguesian plane.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the existence of self-orthogonal diagonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. A Latin square is self-orthogonal if it is orthogonal to its transpose. In an earlier paper Danhof, Phillips and Wallis considered the question of the existence of self-orthogonal diagonal Latin squares of order 10. In this paper we shall present some constructions of self-orthogonal diagonal ...

متن کامل

Discrete phase-space approach to mutually orthogonal Latin squares

Abstract. We show there is a natural connection between Latin squares and commutative sets of monomials defining geometric structures in finite phase-space of prime power dimensions. A complete set of such monomials defines a mutually unbiased basis (MUB) and may be associated with a complete set of mutually orthogonal Latin squares (MOLS). We translate some possible operations on the monomial ...

متن کامل

Constructions of complete sets of orthogonal diagonal Sudoku squares

We prove that complete sets of orthogonal diagonal Sudoku latin squares (sometimes called Sudoku frames) exist of all orders p, where p is a prime. We also show that complete sets of orthogonal Sudoku frames which are left semi-diagonal exist of all orders p, s > 1. We conjecture that these may be right semi-diagonal also but we do not have a general proof. We show how these complete sets may b...

متن کامل

A short note regarding existence of complete sets of orthogonal diagonal Sudoku squares

In an earlier paper, [A.D. Keedwell, Australas J. Combin. 47 (2010), 227–238], we proved that complete sets of orthogonal diagonal Sudoku latin squares exist of all orders p, where p is a prime. We also showed that complete sets of orthogonal Sudoku latin squares which are left semidiagonal exist of all orders p, s > 1, and we conjectured that these may be right semi-diagonal also but we were n...

متن کامل

Upper bounds on sets of orthogonal colorings of graphs

We generalize the notion of orthogonal latin squares to colorings of simple graphs. Two n-colorings of a graph are said to be orthogonal if whenever two vertices share a color in one coloring they have distinct colors in the other coloring. We show that the usual bounds on the maximum size of a certain set of orthogonal latin structures such as latin squares, row latin squares, equi-n squares, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Ars Comb.

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2002